On Newton(like) inequalities for multivariate homogeneous polynomials
نویسنده
چکیده
Let p(x1, ..., xm) = ∑ r1+···+rm=n ar1,...,rm ∏ 1≤i≤m x ri i be a homogeneous polynomial of degree n in m variables. We call such polynomial H-Stable if p(z1, ..., zm) 6= 0 provided that the real parts Re(zi) > 0 : 1 ≤ i ≤ m. It can be assumed WLOG that the coefficients ar1,...,rm := aR ≥ 0. This notion from Control Theory is closely related to the notion of Hyperbolicity intensively used in the PDE theory. Let R0;R1, ..., Rk are integer vectors and R0 = ∑ 1≤j≤k ajRj , where the real numbers aj ≥ 0 : 1 ≤ i ≤ k and ∑ 1≤j≤k aj = 1. We define, for an integer vector R = (r1, ..., rm), R! =: ∏ 1≤i≤m ri!. We prove that log(aRR!) ≥ ∑ 1≤j≤k aj log(aRRj !) − nαn, where 1 2 log(2) ≤ αn ≤ log( n n! ) and get better bounds on αn for sparse polynomials. We relax a notion of H-Stability by introducing two classes of homogeneous polynomials: Alexandrov-Fenchel polynomials and Strongly Log-Concave polynomials, prove analogous inequalities for those classes and use them to prove L-convexity of the supports of polynomials from those classes. We also present a new view on the standard, i.e. when m = 2, Newton inequalities and pose some open problems. Our results provide new necessary conditions forH-Stability and can be used for the identification of multivariate stable linear system, i.e. for the interpolation of H-Stable polynomials. 1 Standard Newton Inequalities Definition 1.1: We define the following closed subset of Rn+1 : LC = {(d0, ..., dn) : di ≥ 0, 0 ≤ i ≤ n; di ≥ di−1di+1, 1 ≤ i ≤ n− 1. We also define a weighted shift operator Shiftc : Rn+1 −→ Rn+1, Shiftc((x0, ..., xn) ) = (c0x1, ..., cn−1xn, 0) . ∗[email protected]. Los Alamos National Laboratory, Los Alamos, NM.
منابع مشابه
On multivariate Newton-like inequalities
We study multivariate entire functions and polynomials with non-negative coefficients. A class of Strongly Log-Concave entire functions, generalizingMinkowski volume polynomials, is introduced: an entire function f in m variables is called Strongly Log-Concave if the function (∂x1) c1 ...(∂xm) mf is either zero or log((∂x1) c1 ...(∂xm) mf) is concave on R + . We start with yet another point of ...
متن کاملA Remez-Type Theorem for Homogeneous Polynomials
Remez-type inequalities provide upper bounds for the uniform norms of polynomials p on given compact sets K, provided that |p(x)| ≤ 1 for every x ∈ K \E, where E is a subset of K of small measure. In this paper we prove sharp Remeztype inequalities for homogeneous polynomials on star-like surfaces in R. In particular, this covers the case of spherical polynomials (when d = 2 we deduce a result ...
متن کاملSchur type inequalities for multivariate polynomials on convex bodies
In this note we give sharp Schur type inequalities for multivariate polynomials with generalized Jacobi weights on arbitrary convex domains. In particular, these results yield estimates for norms of factors of multivariate polynomials.
متن کاملEinladung Im Oberseminar Reelle Geometrie Und Algebra Hält Coercive Polynomials and Their Newton Polytopes
Many interesting properties of polynomials are closely related to the geometry of their Newton polytopes. We analyze the coercivity on R of multivariate polynomials f ∈ R[x] in terms of their Newton polytopes. In fact, we introduce the broad class of so-called gem regular polynomials and characterize their coercivity via conditions imposed on the vertex set of their Newton polytopes. These cond...
متن کاملNumerical Solution of Fuzzy Polynomials by Newton-Raphson Method
The main purpose of this paper is to find fuzzy root of fuzzy polynomials (if exists) by using Newton-Raphson method. The proposed numerical method has capability to solve fuzzy polynomials as well as algebric ones. For this purpose, by using parametric form of fuzzy coefficients of fuzzy polynomial and Newton-Rphson method we can find its fuzzy roots. Finally, we illustrate our approach by nu...
متن کامل